ZO-JADE: Zeroth-order Curvature-Aware Distributed Multi-Agent Convex Optimization

نویسندگان

چکیده

In this work we address the problem of convex optimization in a multi-agent setting where objective is to minimize mean local cost functions whose derivatives are not available (e.g. black-box models). Moreover agents can only communicate with neighbors according connected network topology. Zeroth-order (ZO) has recently gained increasing attention federated learning and scenarios exploiting finite-difference approximations gradient using from $2$ (directional gradient) $2d$ (central difference full evaluations functions, $d$ dimension problem. The contribution extend ZO distributed by estimating curvature via approximations. particular, propose novel algorithm named ZO-JADE, that adding just one extra point, i.e. $2d+1$ total, allows simultaneously estimate diagonal Hessian, which then combined average tracking consensus obtain an approximated Jacobi descent. Guarantees semi-global exponential stability established separation time-scales. Extensive numerical experiments on real-world data confirm efficiency superiority our respect several other zeroth-order methods literature based estimates.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zeroth Order Nonconvex Multi-Agent Optimization over Networks

In this paper we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimizing a class of difficult non-convex problems, and under the challenging setti...

متن کامل

On Zeroth-Order Stochastic Convex Optimization via Random Walks

We propose a method for zeroth order stochastic convex optimization that attains the suboptimality rate of Õ(n7T−1/2) after T queries for a convex bounded function f : R → R. The method is based on a random walk (the Ball Walk) on the epigraph of the function. The randomized approach circumvents the problem of gradient estimation, and appears to be less sensitive to noisy function evaluations c...

متن کامل

Distributed line search for multi-agent convex optimization

This note considers multi-agent systems seeking to optimize a convex aggregate function. We assume that the gradient of this function is distributed, meaning that each agent can compute its corresponding partial derivative with information about its neighbors and itself only. In such scenarios, the discrete-time implementation of the gradient descent method poses the basic challenge of determin...

متن کامل

Stochastic Zeroth-order Optimization in High Dimensions

We consider the problem of optimizing a high-dimensional convex function using stochastic zeroth-order queries. Under sparsity assumptions on the gradients or function values, we present two algorithms: a successive component/feature selection algorithm and a noisy mirror descent algorithm using Lasso gradient estimates, and show that both algorithms have convergence rates that depend only loga...

متن کامل

Distributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and Continuous-Time Convex Optimization

OF THE DISSERTATION Distributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and continuous-time Convex Optimization by Salar Rahili Doctor of Philosophy, Graduate Program in Electrical Engineering University of California, Riverside, December 2016 Dr. Wei Ren, Chairperson A multi-agent system is defined as a collection of autonomous agents which are able to interact w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Control Systems Letters

سال: 2023

ISSN: ['2475-1456']

DOI: https://doi.org/10.1109/lcsys.2023.3281745